Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
981	[removed]Problems A problem (in Computer Science) specifies an input/output relationship, P  I  O. Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:15 Models of computation FO Finite model theory Computability theory Formal methods P Time complexity Finite-state machine Turing machine Theoretical computer science Applied mathematics Complexity classes
982	Emphasize physical realizability. The conventional approach is to measure complexity via SPACE & TIME, which are inherently unbounded by their nature. An alternative approach is to Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:26 Applied mathematics Theory of computation Turing machine Models of computation Computability Pointer machine Computation Alan Turing Hypercomputation Theoretical computer science Computer science Computability theory
983	Microsoft Word - LCC '05.doc Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:06 Computer science Automata theory Computability theory Formal methods Turing machine Pointer machine Finite-state machine Monad Computability Theory of computation Models of computation Theoretical computer science
984	Microsoft PowerPoint - IMS Public Lecture - Slaman Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Mathematical logic Mathematics Kurt Gödel National University of Singapore Philosophy Knowledge Academia Theodore Slaman Computability theory
985	ENUMERATION 1-GENERICITY IN THE LOCAL ENUMERATION DEGREES. LILIANA BADILLO† , CHARLES M. HARRIS‡ , AND MARIYA I. SOSKOVA§∗ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:50:43 Forcing Enumeration Mathematical logic Logic Theory of computation Philosophy of mathematics Turing degree Generic programming Mathematics Enumerative combinatorics Computability theory
986	Splitting and Nonsplitting in the Σ02 Enumeration Degrees∗ M. M. Arslanov1 , S. B. Cooper2 , I. Sh. Kalimullin1 Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2009-10-12 05:07:37 Mathematical logic Symbol Logic Computable function Structure Model theory Busy beaver Spinor Theory of computation Mathematics Computability theory
987	DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:54:41 Turing degree Recursively enumerable set Turing reduction Reduction Structure Order Computability theory Mathematics Enumeration
988	THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA† Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:26:54 Philosophy of mathematics Turing degree Turing jump Enumeration Theodore Slaman Arithmetical set Computability theory Mathematics Logic
989	The Local Structure of the Enumeration Degrees Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2008-07-19 09:57:30 Enumerative combinatorics Mathematical logic Enumeration Recursively enumerable set Degree Turing degree Mathematics Computability theory Theory of computation
990	IOS Press introduces a new journal: Computability The Journal of the Association CiE First volume to be published in 2012, as part of the celebrations of the Alan Turing Year Add to Reading List Source URL: www.computability.de Language: English - Date: 2011-06-23 06:29:31 Mathematics Computability theory Theoretical computer science S. Barry Cooper Alan Turing Computability High British people Science and technology in Europe Science

UPDATE